The semi-balayability of real convolution kernels
نویسندگان
چکیده
منابع مشابه
Semi-Supervised Convolution Graph Kernels for Relation Extraction
Extracting semantic relations between entities is an important step towards automatic text understanding. In this paper, we propose a novel Semi-supervised Convolution Graph Kernel (SCGK) method for semantic Relation Extraction (RE) from natural English text. By encoding sentences as dependency graphs of words, SCGK computes kernels (similarities) between sentences using a convolution strategy,...
متن کاملConvolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discrete structures which require some mechanism to convert them into feature vectors. We describe kernels for various natural language structures, allowing rich, high dimensional representations of these structures. We show...
متن کاملConvolution Kernels for Subjectivity Detection
In this paper, we explore different linguistic structures encoded as convolution kernels for the detection of subjective expressions. The advantage of convolution kernels is that complex structures can be directly provided to a classifier without deriving explicit features. The feature design for the detection of subjective expressions is fairly difficult and there currently exists no commonly ...
متن کاملConvolution Kernels on Discrete Structures
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on a innnite set from kernels involving generators of the set. The family of kernels generated generalizes the family of radial basis kernels. It can also be used to deene kernels in the form of joint Gibbs proba...
متن کاملEmbedding the Semantic Knowledge in Convolution Kernels
Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to solve the problem, this paper proposes a new method to embed the semantic knowledge into kernel calculation. The new method has been applied to extract the ORG-affiliation relation from Chinese texts and achieves an av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1985
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000021516